Extending range queries and nearest neighbors
نویسندگان
چکیده
منابع مشابه
Extending range queries and nearest neighbors
Given an initial rectangular range or k nearest neighbor (k-nn) query (using the L1 metric), we consider the problems of incrementally extending the query by increasing the size of the range, or by increasing k, and reporting the new points incorporated by each extension. Although both problems may be solved trivially by repeatedly applying a traditional range query or L1 k-nn algorithm, such s...
متن کاملRelaxed Reverse Nearest Neighbors Queries
Given a set of users U , a set of facilities F , and a query facility q, a reverse nearest neighbors (RNN) query retrieves every user u for which q is its closest facility. Since q is the closest facility of u, the user u is said to be influenced by q. In this paper, we propose a relaxed definition of influence where a user u is said to be influenced by not only its closest facility but also ev...
متن کاملPine Based Group K-Nearest Neighbors Queries in Road Networks
A common and important query type in spatial networks is to find the Group KNearest Neighbors “GKNN” of a given query objects set. Given two sets of points P and Q, the result of group Knearest neighbors (GKNN) query is the point(s) of P with the smallest sum of distances to all points in Q. Due to the difficulties and the expense of the required calculations to answer such a query, almost all ...
متن کاملQuantifying long-range correlations in complex networks beyond nearest neighbors
We propose a fluctuation analysis to quantify spatial correlations in complex networks. The approach considers the sequences of degrees along shortest paths in the networks and quantifies the fluctuations in analogy to time series. In this work, the Barabasi-Albert (BA) model, the Cayley tree at the percolation transition, a fractal network model, and examples of real-world networks are studied...
متن کاملNearest-neighbors medians clustering
We propose a nonparametric cluster algorithm based on local medians. Each observation is substituted by its local median and this new observation moves toward the peaks and away from the valleys of the distribution. The process is repeated until each observation converges to a fixpoint. We obtain a partition of the sample based on the convergence points. Our algorithm determines the number of c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2000
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(00)00013-4